Shorter arithmetization of nondeterministic computations
نویسندگان
چکیده
منابع مشابه
Shorter arithmetization of nondeterministic computations
Arithmetizing computation is a crucial component of many fundamental results in complexity theory, including results that gave insight into the power of interactive proofs, multi-prover interactive proofs, and probabilistically-checkable proofs. Informally, an arithmetization is a way to encode a machine’s computation so that its correctness can be easily verified via few probabilistic algebrai...
متن کاملCompiling Nondeterministic Computations Pem
Implementing a compiler for such a language with nonde-terministic features is known to be a diicult task. This paper presents two new functions setChoicePoint and fail that extend the C language to eeciently handle choice point management. Algorithms and implementation techniques are detailed. As an application, we give compilation schemes to illustrate the power and the easy use of setChoiceP...
متن کاملEnumeration Reducibility, Nondeterministic Computations and Relative Computability of Partial Functions
In a computation using auxiliary informational inputs one can think of the external resource making itself available in different ways. One way is via an oracle as in Turing reducibility, where information is supplied on demand without any time delay. Alternatively the Scott graph model for lambda calculus suggests a situation where new information, only some of it immediately related to the cu...
متن کاملΩ-Arithmetization of Ellipses
Multi-resolution analysis and numerical precision problems are very important subjects in fields like image analysis or geometrical modeling. In the continuation of our previous works, we propose to apply the method of Ω-arithmetization to ellipses. We obtain a discrete multi-resolution representation of arcs of ellipses. The corresponding algorithms are completely constructive and thus, can be...
متن کاملMy route to arithmetization
I had the pleasure of renewing my acquaintance with Per Lindström at the meeting of the Seventh Scandinavian Logic Symposium, held in Uppsala in August 1996. There at lunch one day, Per said he had long been curious about the development of some of the ideas in my paper [1960] on the arithmetization of metamathematics. In particular, I had used the construction of a non-standard definition !* o...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2015
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2015.07.030